Expressiveness and complexity of graph logic
نویسندگان
چکیده
منابع مشابه
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provides the simplest setting in which to explore such results for spatial logics. We study several forms of the logic: the logic with and without recursion, and with either an exponential or a linear version of the basic com...
متن کاملSeparation logic : expressiveness, complexity, temporal extension
This thesis studies logics which express properties about programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here; rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known befor...
متن کاملExpressiveness and Complexity of the Logic of Public Announcements
We will use K̂iφ as an abbreviation for ¬Ki¬φ and 〈φ〉ψ as an abbreviation for ¬[φ]¬ψ. Definition 2 (Semantics). An epistemic model (or model for short) is a triple M = (S,∼n, V ) with S a non-empty set of states, ∼i an equivalence relation for i < n, and V a function assigning a subset V (p) ⊆ S with each p ∈ PL. Given a modelM = (S,∼n, V ) and an s ∈ S, we define: M, s |= p iff s ∈ V (p) M, s |...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولParameterized Complexity of Graph Constraint Logic
Graph constraint logic is a framework introduced by Hearn and Demaine [6], which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.10.006